Reducing Approximation Error in the Fourier Flexible Functional Form
نویسندگان
چکیده
منابع مشابه
Analyzing the Approximation Error of the Fast Graph Fourier Transform
The graph Fourier transform (GFT) is in general dense and requires O(n) time to compute and O(n) memory space to store. In this paper, we pursue our previous work on the approximate fast graph Fourier transform (FGFT). The FGFT is computed via a truncated Jacobi algorithm, and is defined as the product of J Givens rotations (very sparse orthogonal matrices). The truncation parameter, J , repres...
متن کاملOn the Asymptotic Normality of Fourier Flexible Form Estimates
Rates of increase in the number of parameters of a Fourier factor demand system that imply asymptotically normal elasticity estimates are characterized. The main technical problem in achieving this characterization is caused by the fact that the eigenvalues of the sample sum of squares and cross products matrix of the generalized least squares estimator are not bounded from below. This problem ...
متن کاملA Monte Carlo Study on the Fit of a Cost Function by a Fourier Flexible Functional Form*
We use the simulation model ofCbalfallt and Gallant (IUS5) to investigate the fit of a Fourier flexible form to a cost function when interest is t.o estimate elasticities of substitution. The data is subject to errors in variables and the estimation method is seemingly unrelated regressions. \IVe use two approximating Fourier functional forms * Hesearch supported by C:-IPq ** Banco do Brasil, C...
متن کاملTESTING FOR AUTOCORRELATION IN UNEQUALLY REPLICATED FUNCTIONAL MEASUREMENT ERROR MODELS
In the ordinary linear models, regressing the residuals against lagged values has been suggested as an approach to test the hypothesis of zero autocorrelation among residuals. In this paper we extend these results to the both equally and unequally replicated functionally measurement error models. We consider the equally and unequally replicated cases separately, because in the first case the re...
متن کاملExcess Error , Approximation Error , and Estimation Error
Another question of interest concerns the behaviour of a learning algorithm in the infinite sample limit: as it receives more and more data, does the algorithm converge to an optimal prediction rule, i.e. does the generalization error of the learned function approach the optimal error? Recall that for a distribution D on X × Y and a loss ` : Y × Y→[0,∞), the optimal error w.r.t. D and ` is the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Econometrics
سال: 2017
ISSN: 2225-1146
DOI: 10.3390/econometrics5040053